import java.lang.reflect.Array;
import java.util.Arrays;
import java.util.Scanner;

public class Main {
    //改变数组原有元素的大小
    /*public static void transform(int[] array){
        for (int i = 0; i < array.length; i++) {
            array[i] = array[i]*2;
        }
        for (int i = 0; i < array.length; i++) {
            System.out.println(array[i]);
        }
    }*/

    //求数组元素和的平均值
    /*public static double avg(int[] array){
        int sum = 0;
        for (int i = 0; i < array.length; i++) {
            sum += array[i];
        }
        return (double)sum/array.length;
    }*/

    //奇数偶数交换位置
/*    public static void change(int[] array) {
        for (int i = 0; i < array.length; i++) {
            for (int j = 0; j < array.length - i - 1; j++) {
                int tmp = 0;
                if (array[j] % 2 == 0 && array[j + 1] % 2 != 0) {
                    tmp = array[j];
                    array[j] = array[j + 1];
                    array[j + 1] = tmp;
                }
            }
        }

        for (int i = 0; i < array.length; i++) {
            System.out.println(array[i]);
        }
    }*/

    //实现冒泡排序
/*    public static void bubleSort(int[] array){
        for (int i = 0; i < array.length; i++) {
            for (int j = 0; j < array.length - i - 1; j++) {
                int tmp = 0;
                if (array[j] > array[j+1] ) {
                    tmp = array[j];
                    array[j] = array[j + 1];
                    array[j + 1] = tmp;
                }
            }
        }
        for (int i = 0; i < array.length; i++) {
            System.out.println(array[i]);
        }
    }*/

    //查找对应数组元素
/*    public static int[] twoSum(int[] nums, int target) {
        int[] result = new int[2];
        for(int i = 0; i < nums.length; i++) {
            for(int j = i + 1; j < nums.length; j++) {
                if(nums[i] + nums[j] == target) {
                    result[0] = i;
                    result[1] = j;
                    return result;
                }
            }
        }
        return result;
    }*/

    //找单身狗
/*    public static int findSingleNum(int[] array2){
        int res = 0;
        for (int i = 0; i < array2.length; i++) {
            res = res ^ array2[i];
        }
        return res;
    }*/

    //找多数数字
/*    public static int findMostNum(int[] array2){
        int count = 1;
        int target = array2[0];
            for (int j = 1; j < array2.length; j++) {
                if(count > 0) {
                    if (array2[j] != target) {
                        count--;
                    } else
                        count++;
                } else{
                    target = array2[j];
                    count = 1;
                }
            }
       return target;
    }*/

    public static void isOdd (int[] arr) {
        int count=0;
        for (int i = 0; i < arr.length-2; i++) {
            if(arr[i] % 2 != 0 && arr[i+1] % 2 != 0 && arr[i+2] % 2 != 0){
                count++;
            }
        }
        if(count>=1){
            System.out.println(true);
        }else{
            System.out.println(false);
        }
    }
    public static void main(String[] args) {

        int[] array = {10, 9, 8, 7, 333, 43234, 435656, 234234, 2333};
        //transform(array);
        //double ret = avg(array);
        //System.out.println(ret);
        //change(array);
        //bubleSort(array);
    /*    int[] nums = {1, 2, 4, 5, 11, 23, 24, 21};
        int target = 0;
        Scanner scan = new Scanner(System.in);
        target = scan.nextInt();
        int[] res = twoSum(nums, target);
        System.out.println(Arrays.toString(res));*/

//        int[] array2 = new int[9];
//        Scanner scan = new Scanner(System.in);
//        for (int i = 0; i < array2.length; i++) {
//            array2[i]=scan.nextInt();
//        }
//        /*int ret = findSingleNum(array2);
//        System.out.println(ret);*/
//        int ret = findMostNum(array2);

        int[] arr = {2, 6, 4, 1};
        int[] arr2 = {1, 2, 34, 3, 4, 5, 7, 23, 12};
        isOdd(arr);
        isOdd(arr2);
    }
}

